- Dijkstra's algorithm
- алгоритм Дейкстрыиспользование топологических отношений для поиска кратчайшего маршрута между двумя точками сети
Англо-русский толковый словарь по геоинформатике. В.Ю. Андрианов. 2015.
Dijkstra's algorithm
Смотреть что такое "Dijkstra's algorithm" в других словарях:
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
Dijkstra-Scholten algorithm — The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… … Wikipedia
Dijkstra — (pronounced [ˈdɛikstrɑ]) is a Dutch family name that may refer to: Edsger W. Dijkstra (1930–2002), computer scientist Dijkstra s algorithm, conceived by Edsger Dijkstra is a graph search algorithm that solves the single source shortest path… … Wikipedia
Dijkstra, Edsger Wybe — ▪ 2003 Dutch computer scientist (b. May 11, 1930, Rotterdam, Neth. d. Aug. 6, 2002, Nuenen, Neth.), provided the mathematical foundation for “structured programming”; his idea, which came to be called Dijkstra s algorithm, established the… … Universalium
Dijkstra Prize — The Edsger W. Dijkstra Prize in Distributed Computing is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a … Wikipedia
Dijkstra-Preis — Der Dijkstra Preis ist ein Informatik Preis. Er wird für herausragende Arbeiten in Verteiltem Rechnen (Distributed Computing) vergeben. Er ist seit 2003 nach dessen Tod (2002) zu Ehren von Edsger Wybe Dijkstra benannt und hieß vorher PODC… … Deutsch Wikipedia
Edsger W. Dijkstra — Edsger Wybe Dijkstra Born May 11, 1930(1930 05 11) Rotterdam, Netherl … Wikipedia
Johnson's algorithm — is a way to find shortest paths between all pairs of vertices in a sparse directed graph. It allows some of the edge weights to be negative numbers, but no negative weight cycles may exist.Algorithm descriptionJohnson s algorithm consists of the… … Wikipedia
Algorithme De Dijkstra — En théorie des graphes, l algorithme de Dijkstra sert à résoudre le problème du plus court chemin. Il permet, par exemple, de déterminer le plus court chemin pour se rendre d une ville à une autre connaissant le réseau routier d une région. Il s… … Wikipédia en Français
Algorithme de Dijkstra — En théorie des graphes, l algorithme de Dijkstra (prononcer [dɛjkstra]) sert à résoudre le problème du plus court chemin. Il permet, par exemple, de déterminer le plus court chemin pour se rendre d une ville à une autre connaissant le réseau… … Wikipédia en Français
